ANFIS Construction With Sparse Data via Group Rule Interpolation

نویسندگان

چکیده

A major assumption for constructing an effective adaptive-network-based fuzzy inference system (ANFIS) is that sufficient training data are available. However, in many real-world applications, this may not hold, thereby requiring alternative approaches. In light of observation, article focuses on automated construction ANFISs effort to enhance the potential Takagi-Sugeno regression models situations where only limited particular, proposed approach works by interpolating a group rules certain given domain with assistance existing its neighboring domains. The process involves number computational mechanisms, including rule dictionary which created extracting from ANFISs; interpolated exploiting local linear embedding algorithm build intermediate ANFIS; and fine-tuning method refines resulting ANFIS. experimental evaluation both synthetic datasets reported, demonstrating when facing shortage situations, helps significantly improve performance original ANFIS modeling mechanism.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Subspace Clustering via Group Sparse Coding

We propose in this paper a novel sparse subspace clustering method that regularizes sparse subspace representation by exploiting the structural sharing between tasks and data points via group sparse coding. We derive simple, provably convergent, and computationally efficient algorithms for solving the proposed group formulations. We demonstrate the advantage of the framework on three challengin...

متن کامل

Sparse phase retrieval via group-sparse optimization

This paper deals with sparse phase retrieval, i.e., the problem of estimating a vector from quadratic measurements under the assumption that few components are nonzero. In particular, we consider the problem of finding the sparsest vector consistent with the measurements and reformulate it as a group-sparse optimization problem with linear constraints. Then, we analyze the convex relaxation of ...

متن کامل

Deblocking Joint Photographic Experts Group Compressed Images via Self-learning Sparse Representation

JPEG is one of the most widely used image compression method, but it causes annoying blocking artifacts at low bit-rates. Sparse representation is an efficient technique which can solve many inverse problems in image processing applications such as denoising and deblocking. In this paper, a post-processing method is proposed for reducing JPEG blocking effects via sparse representation. In this ...

متن کامل

Two strategies for sparse data interpolation

I introduce two strategies to overcome the slow convergence of least squares sparse data interpolation: 1) a 2-D multiscale Laplacian regularization operator, and 2) an explicit quadtree-style upsampling scheme which produces a good initial guess for iterative schemes. The multiscale regularization produces an order-of-magnitude speedup in the interpolation of a sparsely sampled topographical m...

متن کامل

seismic data interpolation via a series of new regularizing functions

natural signals are continues, therefore, digitizing is an essential task enabling us to use computing tools to process them. according to the nyquist/shannon sampling theory, the sampling frequency must be at least twice the maximum frequency contained in the signal which is being sampled; otherwise, some high frequencies may be aliased and result in a bad reconstruction. the nyquist sampling ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on cybernetics

سال: 2021

ISSN: ['2168-2275', '2168-2267']

DOI: https://doi.org/10.1109/tcyb.2019.2952267